Geometric Computing with CGAL and LEDA
نویسندگان
چکیده
LEDA and CGAL are platforms for combinatorial and geometric computing. We discuss the use of LEDA and CGAL for geometric computing and show that they provide a unique framework for exact, efficient and convenient geometric computing.
منابع مشابه
Exact Computation with leda_real - Theory and geometric Applications
The number type leda real provides exact computation for a subset of real algebraic numbers: Every integer is a leda real, and leda reals are closed under the basic arithmetic operations +,−, ∗, / and k-th root operations. leda reals guarantee correct results in all comparison operations. The number type is available as part of the leda C++ software library of efficient data types and algorithm...
متن کامل68 Two Computational Geometry Libraries: Leda and Cgal
Over the past decades, two major software libraries that support a wide range of geometric computing have been developed: Leda, the Library of Efficient Data Types and Algorithms, and Cgal, the Computational Geometry Algorithms Library. We start with an introduction of common aspects of both libraries and major differences. We continue with sections that describe each library in detail. Both li...
متن کاملStructural filtering: A paradigm for efficient and exact geometric programs
We introduce a new and simple filtering technique that can be used in the implementation of geometric algorithms called “structural filtering”. Using this filtering technique we gain about 20% when compared to predicatefiltered implementations. Of theoretical interest are some results regarding the robustness of sorting algorithms against erroneous comparisons. There is software support for the...
متن کاملTheory of Real Computation According to EGC
The Exact Geometric Computation (EGC) mode of computation has been developed over the last decade in response to the widespread problem of numerical non-robustness in geometric algorithms. Its technology has been encoded in libraries such as LEDA, CGAL and Core Library. The key feature of EGC is the necessity to decide zero in its computation. This paper addresses the problem of providing a fou...
متن کاملPii: S0925-7721(01)00046-3
In this paper we describe and discuss a new kernel design for geometric computation in the plane. It combines different kinds of floating-point filter techniques and a lazy evaluation scheme with the exact number types provided by LEDA allowing for efficient and exact computation with rational and algebraic geometric objects. It is the first kernel design which uses floating-point filter techni...
متن کامل